Lattice vertex polytopes with interior lattice points
نویسندگان
چکیده
منابع مشابه
Projecting Lattice Polytopes Without Interior Lattice Points
We show that up to unimodular equivalence there are only finitely many d-dimensional lattice polytopes without interior lattice points that do not admit a lattice projection onto a (d− 1)-dimensional lattice polytope without interior lattice points. This was conjectured by Treutlein. As an immediate corollary, we get a short proof of a recent result of Averkov, Wagner &Weismantel, namely the fi...
متن کامل3-Dimensional Lattice Polytopes Without Interior Lattice Points
A theorem of Howe states that every 3-dimensional lattice polytope P whose only lattice points are its vertices, is a Cayley polytope, i.e. P is the convex hull of two lattice polygons with distance one. We want to generalize this result by classifying 3-dimensional lattice polytopes without interior lattice points. The main result will be, that they are up to finite many exceptions either Cayl...
متن کاملLattice Points inside Lattice Polytopes
We show that, for any lattice polytope P ⊂ R, the set int(P ) ∩ lZ (provided it is non-empty) contains a point whose coefficient of asymmetry with respect to P is at most 8d · (8l+7) 2d+1 . If, moreover, P is a simplex, then this bound can be improved to 9 · (8l+ 7) d+1 . This implies that the maximum volume of a lattice polytope P ⊂ R d containing exactly k ≥ 1 points of lZ in its interior, is...
متن کاملLattice 3-Polytopes with Few Lattice Points
This paper is intended as a first step in a program for a full algorithmic enumeration of lattice 3-polytopes. The program is based in the following two facts, that we prove: • For each n there is only a finite number of (equivalence classes of) 3polytopes of lattice width larger than one, where n is the number of lattice points. Polytopes of width one are infinitely many, but easy to classify....
متن کاملLattice Points in Lattice Polytopes
We show that, for any lattice polytope P ⊂ R, the set int(P ) ∩lZ (provided it is non-empty) contains a point whose coefficient ofasymmetry with respect to P is at most 8d · (8l+7)2d+1. If, moreover,P is a simplex, then this bound can be improved to 8 · (8l+ 7)d+1.As an application, we deduce new upper bounds on the volume ofa lattice polytope, given its ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1983
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1983.105.183